Certified Non-Confluence with ConCon 1.5

نویسندگان

  • Thomas Sternagel
  • Christian Sternagel
چکیده

We present three methods to check CTRSs for non-confluence: (1) an ad hoc method for 4-CTRSs, (2) a specialized method for unconditional critical pairs, and finally, (3) a method that employs conditional narrowing to find non-confluence witnesses. We shortly describe our implementation of these methods in ConCon [8], then look into their certification with CeTA [11], and finally conclude with experiments on the confluence problems database (Cops).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Certifying Confluence of Almost Orthogonal CTRSs via Exact Tree Automata Completion

Suzuki et al. showed that properly oriented, right-stable, orthogonal, and oriented conditional term rewrite systems with extra variables in right-hand sides are confluent. We present our Isabelle/HOL formalization of this result, including two generalizations. On the one hand, we relax proper orientedness and orthogonality to extended proper orientedness and almost orthogonality modulo infeasi...

متن کامل

Certified Rule Labeling

The rule labeling heuristic aims to establish confluence of (left-)linear term rewrite systems via decreasing diagrams. We present a formalization of a confluence criterion based on the interplay of relative termination and the rule labeling in the theorem prover Isabelle. Moreover, we report on the integration of this result into the certifier CeTA, facilitating the checking of confluence cert...

متن کامل

Automated Certified Proofs with CiME3

We present the rewriting toolkit CiME3. Amongst other original features, this version enjoys two kinds of engines: to handle and discover proofs of various properties of rewriting systems, and to generate COQ scripts from proofs traces input in certification proof format (CPF) (an XML format widely accepted by the certified rewriting community) in order to certify them with a skeptical proof as...

متن کامل

The Certification Problem Format

We provide an overview of CPF, the certification problem format, and explain some design decisions. Whereas CPF was originally invented to combine three different formats for termination proofs into a single one, in the meanwhile proofs for several other properties of term rewrite systems are also expressible: like confluence, complexity, and completion. As a consequence, the format is already ...

متن کامل

Impact of the Confluence Angle on Flow Field and Flowmeter Accuracy in Open Channel Junctions

Open channel junction is one of the most common hydraulic structures that are used in various practical situations such as sewer, drainage, and flood control systems. Knowing the fluid flow behavior, is one of the most important topics in designing the efficient open channel junctions. The complexity and deviation of flow in the junction’s zone disrupts the proper functioning of the flowmeter d...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1709.05162  شماره 

صفحات  -

تاریخ انتشار 2017